搜索资源列表
GraphAlgorithm
- 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
AlogortithmsExperiment
- 在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点，求其中两点间的最短距离，以及这两点。-the eclipse under development for the plane between two points is the shortest distance. Through random plane generated numerous points, two points for the shortest distance, and these two p
Graphic
- 基于java编程的最短路径算法，已测试，输出最短距离及其路径。-Java programming based on the shortest path algorithm has been tested, the shortest distance and path of the output.
RockAndRoll
- Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be f
8_puzzle
- 8数码问题的Java求解，采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。 某些30步的测试样例需要半分钟左右，但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~ 我用的启发函数计算了现在的网格距离目标网格还有多远。 具体算法是，将每一格中的数字的坐标与其应该在的坐标的差加到一起，得到这个最终值h(x) 也就是Manhattan_Distance 源码使用
Bee
- 确定蜂巢上两点之间的最短距离。给定两点的编号，确定两点之间的距离。-Determine the honeycomb on the shortest distance between two points. Given two numbers, determine the distance between two points.
xiaochong
- Dijsktra算法，Java源码，此代码可以计算任意两点之间的最短距离。-Dijsktra algorithms, Java source code, the code can calculate the shortest distance between any two points.
Floyd
- 使用Floyd算法球出任意两点的最短距离。-Floyd algorithm ball out of the shortest distance between any two points.
MSTApp
- 利用MSTApple算法求出两点之间的最短距离。-MSTApple algorithm using the shortest distance between two points is calculated.
PathApp
- 利用PATHApple算法求出两点之间的最短距离。-PATHApple algorithm using the shortest distance between two points is calculated.
Dijkstra
- Dijkstra算法，查找从原点出发到所有点的最短路径和距离-Dijkstra algorithm to find all the points from the origin to the shortest path and distance
shortpath
- 采用迪杰斯特拉算法实现求解一个城市到其余城市的最短距离-Dijkstra algorithm used to solve a city to the rest of the city' s shortest distance
DS_project3
- 数据结构的project3，实现机场调度，找出两个机场之间的最短路程。可添加机场和航线-Data structure project3, scheduling of airports to find the shortest distance between two airports. Airports and routes can be added
algorithm
- 一些经典算法的java实现：包括：二分查找，最优二搜索树，编辑距离，哈夫曼树，最长公共子序列，矩阵连乘问题，最短路径优先-Some classic algorithm java implementation: including: binary search, and optimal two search tree, the edit distance Huffman tree, the longest common subsequence matrix multiplicative Short
Graph
- Graph measuring the Shortest Distance to vertex, class file for the The Path.java program.
astar-master
- A*算法，A*（A-Star)算法是一种静态路网中求解最短路径最有效的直接搜索方法，也是解决许多搜索问题的有效算法。算法中的距离估算值与实际值越接近，最终搜索速度越快。(A* algorithm and A* (A-Star) algorithm are the most effective direct search methods for solving the shortest path in static road network, and also are effective algo